Padovan, Perrin and Pell-Padovan Dual Quaternions
نویسندگان
چکیده
In this present study, we intend to determine the Padovan, Perrin and Pell-Padovan dual quaternions with nonnegative negative subscripts. line purpose, construct some new properties such as; special determinant equalities, recurrence relations, matrix formulas, Binet-like generating functions, exponential summation binomial for these quaternions.
منابع مشابه
Pell–Padovan-circulant sequences and their applications
This paper develops properties of recurrence sequences defined from circulant matrices obtained from the characteristic polynomial of the Pell–Padovan sequence. The study of these sequences modulo m yields cyclic groups and semigroups from the generating matrices. Finally, we obtain the lengths of the periods of the extended sequences in the extended triangle groups E(2, n, 2), E(2, 2, n) and E...
متن کاملExact Determinants of the RFPrLrR Circulant Involving Jacobsthal, Jacobsthal-Lucas, Perrin and Padovan Numbers
Circulant matrix family occurs in various fields, applied in image processing, communications, signal processing, encoding and preconditioner. Meanwhile, the circulant matrices [1, 2] have been extended in many directions recently. The f(x)-circulant matrix is another natural extension of the research category, please refer to [3, 11]. Recently, some authors researched the circulant type matric...
متن کاملThe Padovan Universal Code
In this paper, we consider the series of Padovan numbers. Thereby, we introduce universal coding scheme based on Padovan numbers. This universal coding are used in source coding as well as in cryptography.
متن کاملPadovan-like sequences and Bell polynomials
We study a class of Padovan-like sequences that can be generated using special matrices of the third order. We show that terms of any sequence of this class can be expressed via Bell polynomials and their derivatives that use as arguments terms of another such sequence with smaller indexes. CAS Mathematica is used for cumbersome calculations and hypothesis testing.
متن کاملComplete Padovan Sequences in Finite Fields
Given a prime p ≥ 5, and given 1 < κ < p − 1, we call a sequence (an)n in Fp a Φκ-sequence if it is periodic with period p− 1, and if it satisfies the linear recurrence an + an+1 = an+κ with a0 = 1. Such a sequence is said to be a complete Φκ-sequence if in addition {a0, a1, . . . , ap−2} = {1, . . . , p− 1}. For instance, every primitive root b mod p generates a complete Φκ-sequence an = b n f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Turkish journal of mathematics & computer science
سال: 2023
ISSN: ['2148-1830']
DOI: https://doi.org/10.47000/tjmcs.999069